Heuristics for multiple knapsack problem
نویسنده
چکیده
The Multiple Knapsack problem (MKP) is a hard combinatorial optimization problem with large application, which embraces many practical problems from different domains, like cargo loading, cutting stock, bin-packing, financial and other management, etc. It also arise as a subproblem in several more complex problems like vehicle routing problem and the algorithms to solve these problems will benefit from any improvement in the field of MKP. The aim of this paper is to compare different kind of heuristic models, statics and dynamics. The heuristics are used by an Ant Colony Optimization (ACO) algorithm to construct solutions to the MKP.
منابع مشابه
APPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING
In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, ite...
متن کاملDominance in Incomplete Solvers for the Multiple Knapsack Problem
We investigate incomplete search algorithms in a search space constrained by a dominance criterion. We propose a new genetic algorithm for the Multiple Knapsack Problem (MKP) which searches a space of candidates which are not dominated according to a dominance criterion. We compare the new algorithm to previous heuristics for the MKP, as well as alternative algorithms, and show experimentally t...
متن کاملCooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem
For hard optimization problems, it is difficult to design heuristic algorithms which exhibit uniformly superior performance for all problem instances. As a result it becomes necessary to tailor the algorithms based on the problem instance. In this paper, we introduce the use of a cooperative problem solving team of heuristics that evolves algorithms for a given problem instance. The efficacy of...
متن کاملA Cutting Plane Based Algorithm for the Multiple Knapsack Problem
In this paper we describe a cutting plane based algorithm for the multiple knapsack problem. We use our algorithm to solve some practical problem instances arising in the layout of electronic circuits and in the design of main frame computers, and we report on our computational experience. This includes a discussion and evaluation of separation algorithms, an LP-based primal heuristic and some ...
متن کاملBalanced Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem
0/1 Multiple Knapsack Problem, a generalization of more popular 0/1 Knapsack Problem, is NP-hard and considered harder than simple Knapsack Problem. 0/1 Multiple Knapsack Problem has many applications in disciplines related to computer science and operations research. Quantum Inspired Evolutionary Algorithms (QIEAs), a subclass of Evolutionary algorithms, are considered effective to solve diffi...
متن کامل